On many-sorted algebraic closure operators
نویسندگان
چکیده
منابع مشابه
On the Many Sorted Closure Operator and the Many Sorted Closure System
For simplicity, we adopt the following rules: i, x, I denote sets, A, M denote many sorted sets indexed by I, f denotes a function, and F denotes a many sorted function indexed by I. The scheme MSSUBSET deals with a set A , a non-empty many sorted set B indexed by A , a many sorted set C indexed by A , and a unary predicate P , and states that: If for every many sorted set X indexed by A holds ...
متن کاملMany Sorted Algebraic Data Models for GIS
Although many GIS data models are available, a declarative, operational, well-defined, implementation-independent, and objectoriented language is lacking. Based on the theory of many sorted algebra, this work presents a family of geometric data models. Some geographical data models of urban information systems are illustrated using homomorphism. According to the results, the preferred character...
متن کاملMorita equivalence of many-sorted algebraic theories
Algebraic theories are called Morita equivalent provided that the corresponding varieties of algebras are equivalent. Generalizing Dukarm’s result from one-sorted theories to many-sorted ones, we prove that all theories Morita equivalent to an S-sorted theory T are obtained as idempotent modifications of T . This is analogous to the classical result of Morita that all rings Morita equivalent to...
متن کاملClosure operators on sets and algebraic lattices
Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such as group, ring, field, lattice, vector space, etc., taking the substructure generated by a set, i.e., the least substructure which includes that set, is a closure operator. Given a binary relation, taking the relation with certain properties, such as reflexive, transitive, equivalence, etc...
متن کاملOn the Trivial Many Sorted Algebras and Many Sorted Congruences
In this paper a, I denote sets and S denotes a non empty non void many sorted signature. The scheme MSSExD deals with a non empty set A and a binary predicate P , and states that: There exists a many sorted set f indexed by A such that for every element i of A holds P [i, f (i)] provided the following condition is met: • For every element i of A there exists a set j such that P [i, j]. Let I be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Nachrichten
سال: 2004
ISSN: 0025-584X,1522-2616
DOI: 10.1002/mana.200310146